Reliable broadcast in anonymous distributed systems with fair lossy channels

نویسندگان

  • Jian Tang
  • Mikel Larrea
  • Sergio Arévalo
  • Ernesto Jiménez
چکیده

Reliable Broadcast is used to disseminate messages among a set of processes with RB broadcast() and RB deliver() operations, which was introduced in [1]. Reliable Broadcast is a broadcast service that requires all non-crashed processes deliver the same set of messages. This service has been extensively studied in non-anonymous systems, usually assuming that communication channels are reliable (if a process p sends a message m to a process q, and q is correct, then q eventually receives m) [2]. However, most of real channels are unreliable (e.g., fair lossy, which means that if a message is sent an arbitrary but finite number of times, there is no guarantee on its reception, it can lose an infinite number of messages [3]). While some work has been done to construct reliable channels over unreliable channels in non-anonymous systems [3], [4], the study of reliable broadcast in anonymous distributed systems with unreliable communication channels still has a big gap that needs to be filled up.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links

When implementing multivalued consensus using binary consensus, previous algorithms assume the availability of uniform reliable broadcast, which is not implementable in systems with fair-lossy links. In this paper, we show that with binary consensus we can implement uniform reliable broadcast directly in systems with fair-lossy links, and thus the separate assumption of the availability of unif...

متن کامل

Broadcasting Messages in Fault-Tolerant Distributed Systems: The Benefit of Handling Input-Triggered and Output-Triggered Suspicions Differently

This paper investigates the two main and seemingly antagonistic approaches to broadcasting messages in fault-tolerant distributed systems: the approach based on Reliable Broadcast, and the one based on View Synchronous Communication (or VSC for short). We discuss both communication primitives in a system model with fair-lossy channel, which leads us to introduce the “time-bounded buffering” pro...

متن کامل

On the Weakest Failure Detector for Uniform Reliable Broadcast∗

Uniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent PODC paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit ...

متن کامل

Revising the Weakest Failure Detector for Uniform Reliable Broadcast

Uniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit this ...

متن کامل

On Verifying Fair Lossy Channel Systems

Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. They are an important computational model because of the role they play in the algorithmic verification of communication protocols. In this paper, we show that fair termination is decidable for a large class of these systems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJHPCN

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2017